Self-affine fractals embedded in spectra of complex networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random subsets of self-affine fractals

We find the almost sure Hausdorff and box-counting dimensions of random subsets of self-affine fractals obtained by selecting subsets at each stage of the hierarchical construction in a statistically self-similar manner.

متن کامل

Exceptional sets for self-affine fractals

Under certain conditions the ‘singular value function’ formula gives the Hausdorff dimension of self-affine fractals for almost all parameters in a family. We show that the size of the set of exceptional parameters is small both in the sense of Hausdorff dimension and Fourier dimension.

متن کامل

Generating Self-Affine Fractals by Collage Grammars

Self-affinity and self-similarity are fundamental concepts in fractal geometry. In this paper, they are related to collage grammars syntactic devices based on hyperedge replacement that generate sets of collages. Essentially, a collage is a picture consisting of geometric parts like line segments, circles, polygons, polyhedra, etc. The overlay of all collages in a collage language yields a frac...

متن کامل

Dimension spectra of random subfractals of self-similar fractals

The dimension of a point x in Euclidean space (meaning the constructive Hausdorff dimension of the singleton set {x}) is the algorithmic information density of x. Roughly speaking, this is the least real number dim(x) such that r× dim(x) bits suffice to specify x on a general-purpose computer with arbitrarily high precision 2−r. The dimension spectrum of a set X in Euclidean space is the subset...

متن کامل

Eigenvalue spectra of complex networks

Abstract We examine the eigenvalue spectrum, ρ(μ), of the adjacency matrix of a random scale-free network with an average of p edges per vertex using the replica method. We show how in the dense limit, when p → ∞, one can obtain two relatively simple coupled equations whose solution yields ρ(μ) for an arbitrary complex network. For scale-free graphs, with degree distribution exponent λ, we obta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2008

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.77.045101